Subtitle Robust Lossless Image Data Hiding

Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing this collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden Two novel robust lossless data hiding algorithms that do not use modulo-256 to achieve losslessness and hence do not generate salt-and-pepper noise have been invented and developed in this project. One is implemented in spatial domain, another in integer wavelet transform domain. Both are based on patchwork theory and both treat blocks of different content with different embedding schemes. Permutation and error correction codes are utilized to enhance robustness. Extensive experimental works have been conducted and have demonstrated the effectiveness of these two algorithms. These two algorithms have been used in a Unified Authentication Framework for JPEG2000 Images, which has now been included in the final committee draft (FCD) 1.0 of the Security Part of JPEG2000 (JPSEC) standard.